A Unifying Location Model on Tree Graphs Based on Submodularity Properties
نویسنده
چکیده
Let % be the collection of nonempty subtrees of a given tree T. Each subtree is viewed as a potential facility. Let f be a real objective function defined on 9. The facility location model we consider is to select a subtree minimizing 1: This model unifies and generalizes several facility location problems discussed in the literature. We prove that the most common objective functions used in facility location theory possess the submodularity property. In particular, the ellipsoid approach provides a unified framework for polynomial solvability.
منابع مشابه
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many various occasions. They model processor networks in which local computations can be easily implemented. The main issue addressed in the paper is to characterize class of triangular graphs (defined globally) by local m...
متن کاملSubmodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions
We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions f satisfying f(x) + f(y) ≥ f(x ⊓ y) + f(x ⊔ y) where the domain of each variable xi corresponds to nodes of a rooted binary tree, and operations ⊓,⊔ are defined with respect to this tree. Special cases include previously studied L-convex and bisubmodular functions, which...
متن کاملModelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibilities to model the Hop Constrained (HC) Connected Facility Location problem (ConFL) as ConFL on layered graphs. We show that on all three layered graphs the respective LP relaxations of two cut based models are of the ...
متن کاملNote on Properties of First Zagreb Index of Graphs
Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 47 شماره
صفحات -
تاریخ انتشار 1993